Concurrent Kleene Algebra
نویسندگان
چکیده
A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange law. We show applicability of the algebra to a partially-ordered trace model of program execution semantics and demonstrate its usefulness by validating familiar proof rules for sequential programs (Hoare triples) and for concurrent ones (Jones’s rely/guarantee calculus). This involves an algebraic notion of invariants; for these the exchange inequation strengthens to an equational distributivity law. Most of our reasoning has been checked by computer.
منابع مشابه
Decision Methods for Concurrent Kleene Algebra with Tests : Based on Derivative
Concurrent Kleene Algebra with Tests (CKAT) were introduced by Peter Jipsen[Jip14]. We give derivatives for CKAT to decide word problems, for example emptiness, equivalence, containment problems. These derivative methods are expanded from derivative methods for Kleene Algebra and Kleene Algebra with Tests[Brz64][Koz08][ABM12]. Additionally, we show that the equivalence problem of CKAT is in EXP...
متن کاملSynchronous Kleene Algebra vs. Concurrent Kleene Algebra
In this year’s CONCUR conference Concurrent Kleene Algebra (CKA) is presented as a general formalism for reasoning about concurrent programs. Also recently Synchronous Kleene Algebra (SKA) was investigated by this author with the purpose of representing and reasoning about actions/programs that have a notion of concurrency in the style of synchrony of the SCCS calculus. CKA has, at first sight,...
متن کاملRamics 2015 15th Int. Conf. on Relational and Algebraic Methods in Computer Science Ramics 2015 – Student Track Decision Methods for Concurrent Kleene Algebra with Tests : Based on Derivative
Concurrent Kleene Algebra with Tests (CKAT) were introduced by Peter Jipsen[Jip14]. We give derivatives for CKAT to decide word problems, for example emptiness, equivalence, containment problems. These derivative methods are expanded from derivative methods for Kleene Algebra and Kleene Algebra with Tests[Brz64][Koz08][ABM12]. Additionally, we show that the equivalence problem of CKAT is in EXP...
متن کاملConcurrent Kleene Algebra: Free Model and Completeness
Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the semantics proposed in the original paper is the free model of CKA with bounded parallel iteration, meaning the completeness of these axioms. This result settles a conjecture of Hoare and collaborators. Moreover, it allows us to establ...
متن کاملConcurrent Kleene algebra with tests and branching automata
We introduce concurrent Kleene algebra with tests (CKAT) as a combination of Kleene algebra with tests (KAT) of Kozen and Smith with concurrent Kleene algebras (CKA), introduced by Hoare, Möller, Struth and Wehrman. CKAT provides a relatively simple algebraic model for reasoning about semantics of concurrent programs. We generalize guarded strings to guarded series-parallel strings, or gsp-stri...
متن کاملFoundations of Communicating Concurrent Kleene Algebra
Communication is integral to the understanding of agent interactions in concurrent systems. In this paper, we propose a mathematical framework for communication and concurrency called Communicating Concurrent Kleene Algebra (C2KA). C2KA supports the ability to work in either a state-based or event-based model for the specification of concurrent and communicating systems by extending concurrent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009